Composite adaptive procedure for solving large sparse linear systems
نویسندگان
چکیده
منابع مشابه
ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods
ITPACK 2C is a collection of seven FORTRAN subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms. Basic iterative procedures, such as the Jacobi method, the Successive Overrelaxation method, the Symmetric Successive Overrelaxation method, and the RS method for the reduced system are combined, where possible, with acceleration procedures such as Chebysh...
متن کاملChallenges in Solving Large Sparse Linear Systems over Finite Fields∗
This talk outlines how very large, sparse linear systems arise in the solution of problems of interest in computational number theory and public-key cryptography, such as the integer factorization and discrete logarithm problems. The linear systems are over finite fields, often the field GF(2) of two elements. We describe some algorithms for solving large sparse linear systems over GF(2), and c...
متن کاملSolving Large Nonsymmetric Sparse Linear Systems Using MCSPARSE
In this paper, the methods and implementation techniques used for the nonsymmetric sparse linear system solver, MCSPARSE, on the Cedar system are described. A novel reordering scheme (H*) upon which the solver is based is presented. The tradeoffs discussed include stability and fill-in control, hierarchical parallelism, and load balancing. Experimental results demonstrating the effectiveness of...
متن کاملIteratively Solving Large Sparse Linear Systems on Parallel Computers
c © 2002 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
متن کاملSolving Large Sparse Linear Systems over Finite Fields
Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over nite elds. This paper presents the results of implementations of several linear algebra algorithms. It shows that very large sparse systems can be solved eeciently by using combinations of structured Gaussian elimination and the conjugate gradie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90392-a